package Day2025_03_12;

public class LeetCode64 {
    public int minPathSum(int[][] grid) {
        int m = grid.length, n = grid[0].length;
        int[][] dp = new int[m][n];
        dp[0][0] = grid[0][0];
        for (int i = 1; i < m; i++) dp[i][0] = grid[i][0] + dp[i - 1][0];
        for (int i = 1; i < n; i++) dp[0][i] = grid[0][i] + dp[0][i - 1];
        for (int i = 1; i < m; i++) {
            for (int j = 1; j < n; j++) {
                dp[i][j] = Math.min(dp[i- 1][j], dp[i][j - 1]) + grid[i][j];
            }
        }
        return dp[m - 1][n - 1];
    }
    public static void main(String[] args) {
        LeetCode64 leetCode64 = new LeetCode64();
        int[][] grid = {{1, 2, 3}, {4, 5, 6}};
        System.out.println(leetCode64.minPathSum(grid));
    }
}
